Generalized Benders Decomposition 1
نویسنده
چکیده
Abs t r ac t . J . F . Benders devised a clever approach for exploiting the structure of mathematical programming problems with complicating variables (variables which, when temporarily fixed, render the remaining optimization problem considerably more tractable). For the class of problems specifically considered by Benders, fixing the values of the complicating variables reduces the given problem to an ordinary linear program, parameterized, of course, by the value of the complicating variables vector. The algorithm he proposed for finding the optimal value of this vector employs a cutting-plane approach for building up adequate representations of (i) the extremal value of the linear program as a function of the parameterizing vector and (ii) the set of values of the parameterizing vector for which the linear program is feasible. Linear programming duality theory was employed to derive the natural families of cuts characterizing these representations, and the parameterized linear program itself is used to generate what are usually deepest cuts for building up the representations. In this paper, Benders' approach is generalized to a broader class of programs in which the parametrized subproblem need no longer be a linear program. Nonlinear convex duality theory is employed to derive the natural families of cuts corresponding to those in Benders' case. The conditions under which such a generalization is possible and appropriate are examined in detail. An illustrative specialization is made to the variable factor programming problem introduced by R. Wilson, where it offers an especially attractive approach. Preliminary computational experience is given.
منابع مشابه
A Benders\' Decomposition Based Solution Method for Solving User Equilibrium Problem: Deterministic and Stochastic Cases
The traffic assignment problem is one of the most important problems for analyzing and optimizing the transportation network to find optimal flows. This study presented a new formulation based on a generalized Benders' decomposition approach to solve its important part, i.e. user equilibrium problems, in deterministic and stochastic cases. The new approach decomposed the problem into a master p...
متن کاملConvergence properties of generalized Benders decompositions
This paper addresses two major issues related to the convergence of generalized Benders decomposition which is an algorithm for the solution of mixed integer linear and nonlinear programming problems. First, it is proved that a mixed integer nonlinear programming formulation with zero nonlinear programming relaxation gap requires only one Benders cut in order to converge, namely the cut corresp...
متن کاملOptimal design of mixed AC-DC distribution systems for commercial buildings: A Nonconvex Generalized Benders Decomposition approach
Direct current (DC) electricity distribution systems have been proposed as an alternative to traditional, alternating current (AC) distribution systems for commercial buildings. Partial replacement of AC distribution with DC distribution can improve service to DC loads and overall building energy efficiency. This article develops (i) a mixed-integer, nonlinear, nonconvex mathematical programmin...
متن کاملA Benders Decomposition Approach for the Symmetric TSP with Generalized Latency Arising in the Design of Semiflexible Transit Systems
متن کامل
Logic-Based Benders Decomposition
Benders decomposition uses a strategy of “learning from one’s mistakes.” The aim of this paper is to extend this strategy to a much larger class of problems. The key is to generalize the linear programming dual used in the classical method to an “inference dual.” Solution of the inference dual takes the form of a logical deduction that yields Benders cuts. The dual is therefore very different f...
متن کاملAccelerating the Composite Power System Planning by Benders Decomposition
This paper presents an application of Benders decomposition to deal with the complexities in the simultaneous Generation Expansion Planning (GEP) and Transmission Expansion Planning (TEP). Unlike the power system operation fields of study, the power system planning methods are not expected to be fast. However, it is always preferable to speed up computations to provide more analysis options for...
متن کامل